Waste Simplification for Warehouse Using Boolean Logic
نویسندگان
چکیده
منابع مشابه
Satisfiability Testing Using Simplification in Boolean Rings
We propose a method for testing satisfiability based on Boolean rings. We make heavy use of simplification, but avoid the potential size increase associated with the use of the distributive law. We present several complexity results, which suggest why our method may be relatively effective in many cases.
متن کاملUsing boolean and fuzzy logic combined with analytic hierarchy process for hazardous waste landfill site selection: A case study from Hormozgan province, Iran
Hazardous wastes include numerous kinds of discarded chemicals and other wastes generated from industrial, commercial, and institutional activities. These types of waste present immediate or long-term risks to humans, animals, plants, or the environment and therefore require special handling for safe disposal. Landfills that can accept hazardous wastes are excavated or engineered sites where th...
متن کاملPocket–pc Boolean Function Simplification
In this paper a useful educational tool is presented for minimizing low order Boolean expressions. The algorithm follows the Karnaugh map looping approach. For the implementation, which provides optimal results, C++ coding was used on the Embedded Visual C++ 3.0 Pocket PC using Windows CE Operating System environment. In order to make the overall implementation efficient, the object oriented ap...
متن کاملFPGA Logic Synthesis Using Quantified Boolean Satisfiability
This paper describes a novel Field Programmable Gate Array (FPGA) logic synthesis technique which determines if a logic function can be implemented in a given programmable circuit and describes how this problem can be formalized and solved using Quantified Boolean Satisfiability. This technique is general enough to be applied to any type of logic function and programmable circuit; thus, it has ...
متن کاملSimplification of Boolean Algebra through DNA Computing
DNA Computing utilizes the properties of DNA for performing the computations. The computations include arithmetic and logical operations such as simplification of Boolean expression to its simplest form. Boolean function can be built from ANDs, ORs, and NOTs using minterm expansion. However, a practicing computer engineer will very rarely be satisfied with a minterm expansion, because as a rule...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering Technology and Sciences
سال: 2019
ISSN: 2462-1269,2289-697X
DOI: 10.15282/ijets.v5i1.2822